Large Neighborhood Search for Electric Vehicle Fleet Scheduling

This work considers the problem of planning how a fleet shared electric vehicles is charged and used for serving set reservations. While exact approaches can be to efficiently solve small medium-sized instances this problem, heuristic have been demonstrated superior in larger instances. The present proposes large neighborhood search approach solving which employs mixed integer linear programming-based repair operator. Three variants using different destroy operators are evaluated on problem. experimental results show that proposed significantly outperforms earlier state-of-the-art methods benchmark by obtaining solutions with up 8.5% better objective values.